Hardness Prediction for the University Course Timetabling Problem
نویسندگان
چکیده
This paper presents an attempt to find a statistical model that predicts the hardness of the University Course Timetabling Problem by analyzing instance properties. The model may later be used for better understanding what makes a particular instance hard. It may also be used for tuning the algorithm actually solving that problem instance. The paper introduces the definition of hardness, explains the statistical approach used for modeling instance hardness, as well as presents results obtained and possible ways of exploiting them.
منابع مشابه
Using fuzzy c-means clustering algorithm for common lecturer timetabling among departments
University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...
متن کاملارایه یک مدل ریاضی جدید جهت برنامه ریزی جدول زمان بندی دروس دانشگاهی بر اساس کیفیت ارایه دروس
One of the important tasks of universities that are usually challenging is university course timetabling problem. They are faced with this problem every year and every term and which is directly effective on education performance. In the university course timetabling problem, the university sources including lessons, lecturers, classes and other teaching sources are assigned to a series of time...
متن کاملA new binary model for university examination timetabling: a case study
Examination timetabling problem (ETP) is one of the most important issues in universities. An improper timetable may result in students' dissatisfaction as it may not let them study enough between two sequential exams. In addition, the many exams to be scheduled, the large number of students who have taken different courses, the limited number of rooms, and some constraints su...
متن کاملGenetic Algorithms for University Course Timetabling Problems
The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...
متن کاملA Review of Distributed Multi-Agent Systems Approach to Solve University Course Timetabling Problem
Scheduling is one the problems on which so many researches have been done over years and university course timetabling problem which is a NP-hard problem is a type of scheduling problem. On the other hand, timetabling process must be done for each semester frequently which is an exhausting and time consuming task. University course timetabling problem performs the allocation of whole events to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004